Special factors and the combinatorics of suffix and factor automata

Parallel Construction of Minimal Suffix and Factor Automata

This paper gives optimal parallel algorithms for the construction of the smallest deterministic finite automata recognizing all the suffixes and the factors of a string. The algorithms use recently discovered optimal parallel suffix tree construction algorithms together with data structures for the efficient manipulation of trees, exploiting the well known relation between suffix and factor aut...

Combinatorics of Finite Words and Suffix Automata

A detail analysis on factor oracle construction of computing repeated factors

We show a detail implementation for a linear time and space method, introduced in [3], to compute the length of a repeated suffix for each prefix of a given word p. This method is based on the utilization of the factor oracle [1] of p, which is deterministic acyclic automata accepting all subustrings of p. keyword: factor oracle, suffix link, repetition

General suffix automaton construction algorithm and space bounds

Suffix automata and factor automata are efficient data structures for representing the full index of a set of strings. They are minimal deterministic automata representing the set of all suffixes or substrings of a set of strings. This paper presents a novel analysis of the size of the suffix automaton or factor automaton of a set of strings. It shows that the suffix automaton or factor automat...

Spanning 2-Connected Subgraphs in Alphabet Graphs, Special Classes of Grid Graphs